On the convergence of the gradient projection method for convex optimal control problems with bang–bang solutions
نویسندگان
چکیده
منابع مشابه
The Gradient Projection Method for Solving an Optimal Control Problem
A gradient method for solving an optimal control problem described by a parabolic equation is considered. The gradient projection method is applied to solve the problem. The convergence of the projection algorithm is investigated.
متن کامل“the effect of risk aversion on the demand for life insurance: the case of iranian life insurance market”
abstract: about 60% of total premium of insurance industry is pertained?to life policies in the world; while the life insurance total premium in iran is less than 6% of total premium in insurance industry in 2008 (sigma, no 3/2009). among the reasons that discourage the life insurance industry is the problem of adverse selection. adverse selection theory describes a situation where the inf...
15 صفحه اولConvergence of the Lagrange-newton Method for Optimal Control Problems
Convergence results for two Lagrange-Newton-type methods of solving optimal control problems are presented. It is shown how the methods can be applied to a class of optimal control problems for nonlinear ODEs, subject to mixed control-state constraints. The first method reduces to an SQP algorithm. It does not require any information on the structure of the optimal solution. The other one is th...
متن کاملAn Effective Gradient Projection Method for Stochastic Optimal Control
In this work, we propose a simple yet effective gradient projection algorithm for a class of stochastic optimal control problems. The basic iteration block is to compute gradient projection of the objective functional by solving the state and co-state equations via some Euler methods and by using the Monte Carlo simulations. Convergence properties are discussed and extensive numerical tests are...
متن کاملStrong convergence of modified gradient-projection algorithm for constrained convex minimization problems
In this article, a modified gradient-projection algorithm (GPA) is introduced, which combines Xu’s idea of an alternative averaged mapping approach to the GPA and the general iterative method for nonexpansive mappings in Hilbert space introduced by Marino and Xu. Under suitable conditions, it is proved that the strong convergence of the sequences generated by implicit and explicit schemes to a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2018
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-018-9981-6